Resource Sharing Interconnection Networks in Multiprocessors

In this paper, circuit-switched interconnection networks for resource sharing in multiprocessors, named resource sharing interconnection networks, are studied. Resource scheduling in systems with such an interconnection network entails the efficient search of a mapping from requesting processors to free resources such that circuit blockages in the network are minimized and resources are maximally used. The optimal mapping is obtained by transforming the scheduling problems into various network flow problems for which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is also described. The proposed method is applicable to any general loop-free network configuration in which the requesting processors and free resources can be partitioned into two disjoint subsets.